Intelligent shared-segment protection
نویسندگان
چکیده
Progress in network technologies and protocols is paving the road towards flexible optical transport networks, in which dynamic leasable circuits could be set up and released on a short-term basis according to customers’ requirements. Recently, new solutions for automatized network management promise to allow customers to specify the terms of the service level agreement (SLA) to be guaranteed (with different price range) by the service provider. In this paper we consider that these service level specifications (SLS), since they are now made available on-demand during the connection request, could be exploited to retrieve useful information able to improve the routing efficiency. In particular, we propose to exploit the knowledge of connection holding time, among the other SLS, to develop a novel intelligent approach for shared-segment protection (SSP). We will exploit the knowledge of the holding-time of connection requests to minimize resource overbuild due to backup capacity and hence to achieve resource-usage efficiency. For a typical US nationwide network, we compare our two proposed holding-time aware approaches to the respective two holding-time-unaware approaches: both of them, even in their holding-time unaware version, have been shown to be very efficient solutions for shared-segment protection. Nonetheless, we have obtained additional savings on resource overbuild of up to 11% for practical scenarios exploiting holding-time knowledge. 2008 Published by Elsevier B.V.
منابع مشابه
Efficient Shared Segment Protection in Optical Networks
Efficient Shared Segment Protection
متن کاملPragmatic Segment Protection Employing Distributed Multiple-ring Search in WDM Mesh Networks
This work proposes the segment fault protection mechanism called Non-Overlap Segment Protection (NOSP) and Overlap Segment Protection (OSP) using the method of multiple-ring search in Wavelength Division Multiplexing (WDM) mesh networks. Multiple-ring search operates in distributed control, and gathers network information through neighboring nodes. Hence, the proposed methods can be adopted in ...
متن کاملLinear Formulation for Segment Shared Protection
This paper proposes a novel linear formulation for the problem of segment shared protection, where the switching/merging nodes and the least-cost link-disjoint working and protection segments corresponding to each switching/merging node-pair are jointly determined for a connection request. A novel approach of arc-reversal graph transformation is introduced. We verify the ILP and compare it with...
متن کاملMinimum Interference Routing Adding Shared Segment Protection in GMPLS-based Networks*
This paper presents a novel method to enhance minimum interference routing by adding shared segment protection in GMPLS-based networks. Minimum interference routing without maximum flow computation and shared backup schemes are combined to set up novel online restorable QoS routing algorithms. Proposed method also considers protection at the lower optical level by not overprotecting paths, whic...
متن کاملNovel algorithms for shared segment protection
The major challenges in designing survivable schemes are how to allocate minimal amount of spare resources (e.g., bandwidth) using fast (e.g., polynomial-time) algorithms, and in case a failure occurs, to be able to quickly recover from it. All existing approaches invariably make tradeoffs. In this paper, we propose novel shared segment protection algorithms which make little or no compromise. ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Computer Networks
دوره 52 شماره
صفحات -
تاریخ انتشار 2008